Practical Concurrent Programming for Parallel Machines

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

متن کامل

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...

متن کامل

Optimising Parallel Logic Programming Systems for Scalable Machines Optimising Parallel Logic Programming Systems for Scalable Machines

Logic programs are good examples of symbolic applications that often exhibit large amounts of implicit parallelism and that can greatly beneet from parallel computers. Parallel logic programming (PLP) systems have obtained excellent results for traditional bus-based shared-memory architectures. However, the scalable multiprocessors being developed today pose new challenges, such as the high lat...

متن کامل

Object-Oriented Programming for Massively Parallel Machines

Large, robust massively parallel programs that are understandable (and therefore maintain-able) are not yet a reality. Such programs require a programming methodology that minimizes the conceptual diierences between the program and the domain addressed by the program, encourages reusability, and still produces robust programs that are readily maintained and reasoned about. This paper proposes t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1991

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/34.4.302